An analytical model for Loc/ID mappings caches

Concerns regarding the scalability of the interdomain routing have encouraged researchers to start elaborating a more robust Internet architecture. While consensus on the exact form of the solution is yet to be found, the need for a semantic decoupling of a node's location and identity is generally accepted as a promising way forward. However, this typically requires the use of caches that store temporal bindings between the two namespaces, to avoid hampering router packet forwarding speeds. In this article, we propose a methodology for an analytical analysis of cache performance that relies on the working-set theory. We first identify the conditions that network traffic must comply with for the theory to be applicable and then develop a model that predicts average cache miss rates relying on easily measurable traffic parameters. We validate the result by emulation, using real packet traces collected at the egress points of a campus and an academic network. To prove its versatility, we extend the model to consider cache polluting user traffic and observe that simple, low intensity attacks drastically reduce performance, whereby manufacturers should either overprovision router memory or implement more complex cache eviction policies.Peer ReviewedPostprint (author's final draft

Programmable overlays via OpenOverlayRouter

Among the different options to instantiate overlays, the Locator/ID Separation Protocol (LISP) [7] has gained significant traction among industry and academia [5], [6], [8]–[11], [14], [15]. Interestingly, LISP offers a standard, inter-domain, and dynamic overlay that enables low capital expenditure (CAPEX) innovation at the network layer [8]. LISP follows a map-and-encap approach where overlay identifiers are mapped to underlay locators. Overlay traffic is encapsulated into locator-based packets and routed through the underlay. LISP leverages a public database to store overlay-to-underlay mappings and on a pull mechanism to retrieve those mappings on demand from the data plane. Therefore, LISP effectively decouples the control and data planes, since control plane policies are pushed to the database rather than to the data plane. Forwarding elements reflect control policies on the data plane by pulling them from the database. In that sense, LISP can be used as an SDN southbound protocol to enable programmable overlay networks [5].Peer ReviewedPostprint (published version

Knowledge-defined networking

The research community has considered in the past the application of Artificial Intelligence (AI) techniques to control and operate networks. A notable example is the Knowledge Plane proposed by D.Clark et al. However, such techniques have not been extensively prototyped or deployed in the field yet. In this paper, we explore the reasons for the lack of adoption and posit that the rise of two recent paradigms: Software-Defined Networking (SDN) and Network Analytics (NA), will facilitate the adoption of AI techniques in the context of network operation and control. We describe a new paradigm that accommodates and exploits SDN, NA and AI, and provide use-cases that illustrate its applicability and benefits. We also present simple experimental results that support, for some relevant use-cases, its feasibility. We refer to this new paradigm as Knowledge-Defined Networking (KDN).Peer ReviewedPostprint (author's final draft

Pasteurisation and electricity in the food industry 3 EDF case studies

Translated from French (EDF Direction de la Distribution, Service Commercial 1986-1987)SIGLEAvailable from British Library Document Supply Centre- DSC:6196.3(OA-Trans--2963)T / BLDSC - British Library Document Supply CentreGBUnited Kingdo

Path-vector routing stability analysis

In this paper, we define a set of metrics that characterize the local stability properties of path-vector routing protocols such as BGP (Border Gateway Protocol). By means of these stability metrics, we propose a method to analyze the effects of BGP policy- and protocol-induced instability on local routers.Peer Reviewe

An analytical model for Loc/ID mappings caches

Concerns regarding the scalability of the interdomain routing have encouraged researchers to start elaborating a more robust Internet architecture. While consensus on the exact form of the solution is yet to be found, the need for a semantic decoupling of a node's location and identity is generally accepted as a promising way forward. However, this typically requires the use of caches that store temporal bindings between the two namespaces, to avoid hampering router packet forwarding speeds. In this article, we propose a methodology for an analytical analysis of cache performance that relies on the working-set theory. We first identify the conditions that network traffic must comply with for the theory to be applicable and then develop a model that predicts average cache miss rates relying on easily measurable traffic parameters. We validate the result by emulation, using real packet traces collected at the egress points of a campus and an academic network. To prove its versatility, we extend the model to consider cache polluting user traffic and observe that simple, low intensity attacks drastically reduce performance, whereby manufacturers should either overprovision router memory or implement more complex cache eviction policies.Peer Reviewe

Implementing a BGP-free ISP core with LISP

The sustained growth of the global routing table is exerting an economical strain on ISPs by requiring untimely router upgrades. Notably, it has been speculated that the growth rate of router FIBs is surpassing that of its supporting technology and that the deployment of IPv6 is only to make matters worse. In this paper, we propose LISP-MPS, an architecture based on LISP, that isolates the intra-domain routing of an Autonomous System (AS) from its inter-domain routing. The resulting separation implies the decrease of backbone routing table sizes and enables an AS to control the forwarding of traffic inside its network. For a seamless, cost effective, and incremental deployment, LISP-MPS leverages iBGP to implement the LISP mapping system functionality with minimal modification to a small subset of deployed equipment. Finally, an analysis of realistic topologies shows that, despite changing how packets transit a network, the architecture does not lose resilience to failures. Moreover, we show that it can be a viable alternative to BGP/MPLS deployments due to its low implementation cost.Peer ReviewedPostprint (published version

Structural failure and the ship designer

SIGLEAvailable from British Library Document Supply Centre- DSC:9110.2555(NAOE--87-32) / BLDSC - British Library Document Supply CentreGBUnited Kingdo

Lcast: software-defined inter-domain multicast

Traditionally, efficient inter-domain data delivery may be implemented either as a network or as an application layer multicast service. However, while the former has seen little uptake due to prohibitive deployment costs the latter is widely used today, but often without a minimum guaranteed performance. In this paper we present Lcast, a network-layer single-source multicast framework designed to merge the robustness and efficiency of IP multicast with the configurability and low deployment cost of application-layer overlays. The architecture involves no end-host changes and only requires the upgrading of a small set of routers to support the Locator/ID Separation Protocol (LISP), an incrementally deployable enhancement to the current global routing infrastructure. Content distribution over the Internet's core is done by means of a router overlay while within domains, end-hosts interface with Lcast using conventional multicast protocols. The overlay's scalability and topological configurability is sustained by logically centralizing group management. We illustrate the versatility of our solution by designing and assessing the scalability and performance of three management strategies for low latency content distribution. Our analysis is based on large scale simulations supported by realistic user behavior and Internet-like network topologies. The results show Lcast's low management overhead and ability to optimize delivery to meet various operational constraints. Notably, we find that it can deliver traffic with latencies close to unicast ones, independent of overlay size.Peer Reviewe

Implementing a BGP-free ISP core with LISP

The sustained growth of the global routing table is exerting an economical strain on ISPs by requiring untimely router upgrades. Notably, it has been speculated that the growth rate of router FIBs is surpassing that of its supporting technology and that the deployment of IPv6 is only to make matters worse. In this paper, we propose LISP-MPS, an architecture based on LISP, that isolates the intra-domain routing of an Autonomous System (AS) from its inter-domain routing. The resulting separation implies the decrease of backbone routing table sizes and enables an AS to control the forwarding of traffic inside its network. For a seamless, cost effective, and incremental deployment, LISP-MPS leverages iBGP to implement the LISP mapping system functionality with minimal modification to a small subset of deployed equipment. Finally, an analysis of realistic topologies shows that, despite changing how packets transit a network, the architecture does not lose resilience to failures. Moreover, we show that it can be a viable alternative to BGP/MPLS deployments due to its low implementation cost.Peer Reviewe